Queue Back-Pressure Random Access in Multihop Wireless Networks: Optimality and Stability
نویسندگان
چکیده
منابع مشابه
Routing in Random Multihop Wireless Networks
A. Proof of Lemma 2 Lemma 2 We have ∠wut ≤ α if ‖uv‖+‖vw‖ ≤ r, ∠vut ≤ α and ∠wvt ≤ α. Proof: Without loss of generality, we assume that node v is on top of the line crossing u and t. Let 2xuy and 2avb be the sectors of the forwarding region defined by node u and v respectively for destination node t. To prove the lemma, it is equivalent to show that the intersected region by 2avb with disk D(u,...
متن کاملQueue-Based Random-Access Algorithms: Fluid Limits and Stability Issues
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملDelay-Constrained Utility Maximization in Multihop Random Access Networks
Multi-hop random access networks have received much attention due to their distributed nature which facilitates deploying many new applications over the sensor and computer networks. Recently, utility maximization framework is applied in order to optimize performance of such networks however delay is not limited and proposed algorithms result in very large transmission delays. In this paper, we...
متن کاملPer-queue stability analysis of a random access system
up response of the pendulum starting at nearly the vertically downward position, with the remaining initial conditions zero. Notice that the response is very fast without any initial swinging of the pendulum. The following remarks are in order. • It is clear from the simulations that the stabilization mechanism of our controller consists of spinning-up the disk inertia to lift the pendulum, whi...
متن کاملInsensitivity and stability of random-access networks
Random-access algorithms such as the Carrier-Sense Multiple-Access (CSMA) protocol provide a popular mechanism for distributed medium access control in large-scale wireless networks. In recent years, fairly tractable models have been shown to yield remarkably accurate throughput estimates for CSMA networks. These models typically assume that both the transmission durations and the back-off peri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2009
ISSN: 0018-9448
DOI: 10.1109/tit.2009.2025563